منابع مشابه
Hyperbolic Bridged Graphs
In this paper, all graphs are simple and connected, but they are not necessarily finite. As is well known, a (connected) graph G comes equipped with a natural metric on its vertex set V (G), given by defining the distance xy between any pair of vertices x, y ∈ V (G) to be the length of some shortest path or geodesic between x and y. Given a quartet x, y, u, v ∈ V (G), define δ(x, y, u, v) to be...
متن کاملScaled Gromov hyperbolic graphs
In this paper, the δ-hyperbolic concept, originally developed for infinite graphs, is adapted to very large but finite graphs. Such graphs can indeed exhibit properties typical of negatively curved spaces, yet the traditional δ-hyperbolic concept, which requires existence of an upper bound on the fatness δ of the geodesic triangles, is unable to capture those properties, as any finite graph has...
متن کاملBridged Graphs Are Cop-Win Graphs: An Algorithmic Proof
A graph is bridged if it contains no isometric cycles of length greater than three. Anstee and Farber established that bridged graphs are cop-win graphs. According to Nowakowski and Winkler and Quilliot, a graph is a cop-win graph if and only if its vertices admit a linear ordering v1 , v2 , ..., vn such that every vertex vi , i>1, is dominated by some neighbour vj , j<i, i.e., every vertex vk ...
متن کاملConsequences of an algorithm for bridged graphs
Chepoi showed that every breadth /rst search of a bridged graph produces a cop-win ordering of the graph. We note here that Chepoi’s proof gives a simple proof of the theorem that G is bridged if and only if G is cop-win and has no induced cycle of length four or /ve, and that this characterization together with Chepoi’s proof reduces the time complexity of bridged graph recognition. Speci/call...
متن کاملHarmonic functions on hyperbolic graphs
We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The proof is inspired by the works of F. Mouton in the cases of Riemannian manifolds of pinched negative curvature and infinite trees. It involves geometric and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2002
ISSN: 0195-6698
DOI: 10.1006/eujc.2002.0591